Note on packing and weak-packing measures with Hausdorff functions
نویسندگان
چکیده
منابع مشابه
Packing and Hausdorff measures of stable trees
In this paper we discuss Hausdorff and packing measures of random continuous trees called stable trees. Stable trees form a specific class of Lévy trees (introduced by Le Gall and Le Jan in [28]) that contains Aldous’s continuum random tree which corresponds to the Brownian case. We provide results for the whole stable trees and for their level sets that are the sets of points situated at a giv...
متن کاملA note on packing connectorsJ
Given an undirected graph G = (V; E) and a partition fS; T g of V , an S{T connector is a set of edges F E such that every component of the subgraph (V; F) intersects both S and T. We show that G has k edge-disjoint S{T connectors if and only if j G (V 1) : : : G (V t)j kt for every collection fV 1 ; : : : ; V t g of disjoint nonempty subsets of S and for every such collection of subsets of T. ...
متن کاملNote : Anote on circle packing ∗
The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parallelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit (GPU) on comm...
متن کاملPacking Measures and Dimensions on Cartesian Products
Packing measures Pg(E) and Hewitt-Stromberg measures νg(E) and their relatives are investigated. It is shown, for instance, that for any metric spaces X, Y and any Hausdorff functions f , g ν(X) ·P(Y ) 6 P(X × Y ). The inequality for the corresponding dimensions is established and used for a solution of a problem of Hu and Taylor: If X ⊆ Rn, then inf{dimPX × Y − dimPY : Y ⊆ R} = lim inf Xn↗X di...
متن کاملNote on non-uniform bin packing games
A non-uniform bin packing game is an N-person cooperative game, where the set N is defined by k bins of capacities b1, . . . , bk and n items of sizes a1, . . . , an. The objective function v of a coalition is the maximum total value of the items of that coalition which can be packed to the bins of that coalition. We investigate the taxation model of Faigle and Kern (1993) [2] and show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2006
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2005.06.082